Notes on Freiman’s Theorem
نویسنده
چکیده
Freiman’s Theorem describes the structure of a set A under the condition that A+ A has size close to that of A. If P is a generalized arithmetic progression, then |P +P | is close to |P |. Freiman’s Theorem states the partial converse: if |P + P | is close to P then P must be contained in a small generalized arithmetic progression. The theorem may be stated as follows, and we will give the remarkable proof of this theorem due to Ruzsa.
منابع مشابه
A Polynomial Bound in Freiman’s Theorem
In this paper the following improvement on Freiman’s theorem on set addition is obtained. (Theorem 1 and Theorem 2 in Section 1.) Let A ⊂ Z be a finite set such that |A + A| < α|A|. Then A is contained in a proper d-dimensional progression P , where d ≤ [α− 1] and log |P | |A| < Cα2(log α)3. Earlier bounds involved exponential dependence in α in the second estimate. Our argument combines Ruzsa’...
متن کاملOn Freiman’s Theorem in Nilpotent Groups
We generalize a result of Tao which extends Freiman’s theorem to the Heisenberg group. We extend it to simply connected nilpotent Lie groups of arbitrary step.
متن کاملOn Freiman’s 2.4-theorem
Gregory Freiman’s celebrated “2.4-Theorem” says that if A is a set of residue classes modulo a prime p satisfying |2A| ≤ 2.4|A|−3 and |A| < p/35, then A is contained in an arithmetic progression of length |2A|−|A|+1. Without much extra effort, the bound |A| < p/35 can be relaxed to |A| ≤ p/11.3. A result of Freiman on the distribution of points on the circle plays an important rôle in the proof...
متن کاملSome Applications of Freiman’s Inverse Theorem
OF THE DISSERTATION Some applications of Freiman’s inverse theorem by Hoi H. Nguyen Dissertation Director: Prof. Van Vu The celebrated Freiman’s inverse theorem in Additive Combinatorics asserts that an additive set of small doubling constant must have additive structure. This thesis contains two applications achieved by combining this theorem with a dyadic pigeonhole principle technique. 1. A ...
متن کاملCombinatorial Aspects of Szemerédi ’ S Theorem
In the first section we review the beautiful combinatorial theory of Ramsey as well as the history of Szemerédi’s theorem. In Section 2 we give a sketch of Ruzsa’s modern proof of Freiman’s theorem on sumsets which plays an important role in Gowers’ quantitative proof of Szemerédi’s theorem. In the last section we deduce Roth’s theorem (Szemerédi’s theorem in the case k=3) from the Triangle Rem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010